MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis
نویسندگان
چکیده
MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008 and improved in PQC 2008. This article gives an overview over the MutantXL algorithm. It also presents experimental results comparing the behavior of the MutantXL algorithm to the F4 algorithm on HFE and randomly generated multivariate systems. In both cases MutantXL is faster and uses less memory than the Magma’s implementation of F4.
منابع مشابه
Algebraic Cryptanalysis of MQQ Public Key Cryptosystem by MutantXL
In this paper, we present an efficient attack of the multivariate Quadratic Quasigroups (MQQ) cryptosystem. Our cryptanalysis breaks MQQ cryptosystems by solving systems of multivariate quadratic polynomial equations using a modified version of the MutantXL algorithm. We present experimental results comparing the behavior of our implementation of MutantXL to Magma’s implementation of F4 on MQQ ...
متن کاملAlgebraic Attack on the MQQ Public Key Cryptosystem
In this paper, we present an efficient attack on the multivariate Quadratic Quasigroups (MQQ) public key cryptosystem. Our cryptanalysis breaks the MQQ cryptosystem by solving a system of multivariate quadratic polynomial equations using both the MutantXL algorithm and the F4 algorithm. We present the experimental results that show that MQQ systems is broken up to size n equal to 300. Based on ...
متن کاملMXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008. This paper proposes two substantial improvements to this algorithm over GF(2) that result in significantly reduced memory usage. We present experimental results comparing MXL2 to the XL algorithm, the MutantXL algorithm and Magma’s implementation of F4. For this comparison we have chosen small, r...
متن کاملAlgebraic Attacks Galore!
Received: May 15, 2009 This is the first in a two-part survey of current techniques in algebraic cryptanalysis. After introducing the basic setup of algebraic attacks and discussing several attack scenarios for symmetric cryptosystems, public key cryptosystems, and stream ciphers, we discuss a number of individual methods. The XL, XSL, and MutantXL attacks are based on linearization techniques ...
متن کاملSolving Systems of Multivariate Quadratic Equations over Finite Fields or: From Relinearization to MutantXL
In this article we investigate algorithms for solving non-linear multivariate equations over nite elds and the relation between them. For non binary elds usually computing the Gröbner basis of the corresponding ideal is the best choice in this context. One class of algorithms is based on Buchberger's algorithm. Today's best algorithms like F4 and F5 belong to this class. Another strategy to sol...
متن کامل